Coincidences of Substitution Systems

نویسندگان

  • Ian Hoffman
  • Michael S. Keane
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Modular Coincidences for Substitution Tilings and Point Sets

Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the number of iterations needed. The main tool is a simple algorithm for computing modular coincidences, which is essentially a generalization of Dekking coincidence t...

متن کامل

Computing Modular Coincidences

Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R d , consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the number of iterations needed. The main tool is a simple algorithm for computing modular coincidences, which is essentially a generalization of Dekking coincidenc...

متن کامل

Application of queuing theory in inventory systems with substitution flexibility

Considering the competition in today’s business environment, tactical planning of a supply chain becomes more complex than before. In many multi-product inventory systems, substitution flexibility can improve profits. This paper aims to prepare a comprehensive substitution inventory model, where an inventory system with two substitute products with ignorable lead time has been considered, and e...

متن کامل

The S-adic Pisot Conjecture on Two Letters

We prove an extension of the well-known Pisot substitution conjecture to the S-adic symbolic setting on two letters. The proof relies on the use of Rauzy fractals and on the fact that strong coincidences hold in this framework.

متن کامل

Coincidences Are not Accidental: a Theorem

In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof uses a version of Kolmogorov complexity, a technique originally developed to describe randomness and “accidentalness”. 1 Coincidences are not Accidental: A Useful Empirical Fact Coincidences happen. In mathematics and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013